High-Precision Leveled Homomorphic Encryption for Rational Numbers

In most homomorphic encryption schemes based on RLWE, native plaintexts are represented as polynomials in a ring Zt[x]/xN+1, where t is plaintext modulus and xN+1 cyclotomic polynomial with degree power of two. An encoding scheme should be used to transform some natural data types (such integers rational numbers) into the ring. After computations aare finished, decoding procedure invoked obtain results. We employ Hensel code for numbers construct high-precision leveled double-CRT. The advantage our that limitations previous works avoided, such unexpected results loss precision. Moreover, space can adjusted simply by changing hyper-parameter adapt different computation tasks.